摘要 :
The aim of this research is to develop an examining system of students' registration to protect the rule violation problems, such as taking two subjects where one is prerequisite of the other, in the same semester. Another problem...
展开
The aim of this research is to develop an examining system of students' registration to protect the rule violation problems, such as taking two subjects where one is prerequisite of the other, in the same semester. Another problem is taking unrequired courses more than those stated in the academic rules causing the total Units of unrequired courses over those of required courses. In the former system the advisors checked various Problems by themselves which was time consuming. This developing system will held the advisors to reduce Not only time wasted in examining the registration but also errors which may occur.
收起
摘要 :
Most modern database management systems (DBMS) provide the ability to restrict user access to database objects. The problems of restricting access to individual records are arising increasingly in connection with the growing need ...
展开
Most modern database management systems (DBMS) provide the ability to restrict user access to database objects. The problems of restricting access to individual records are arising increasingly in connection with the growing need for flexibility in restricting access in modern databases, including when using them to store information classified as state or commercial secrets. Currently, these tasks are solved individually, and there are no commonly formalized approaches to designing such access restrictions. The study aims to reduce the design time for database schemes when it is necessary to restrict access to individual records of the database tables and improve the quality of the designed schemes by using the proposed algorithms. Questions about the design of the protected databases with the use of access restrictions to separate records are considered. Both restriction of illegal access to records, and granting false camouflage information instead of required is considered. The proposed software package will consist of 2 main parts: a database and a client application. To differentiate access, the study proposed the use of a record-protecting lock.
收起
摘要 :
Development of a trial Food Composition Database System has been put into practice by JST using the Special Coordination Funds for Promoting Science and Technology for 3 years from 1994 to 1996. It includes not only character data...
展开
Development of a trial Food Composition Database System has been put into practice by JST using the Special Coordination Funds for Promoting Science and Technology for 3 years from 1994 to 1996. It includes not only character data from Standard Tables of Food Composition of Japan, 4th revised edition and follow-up tables and food sampling data but also food picture data which are produced by scanning and digitizing. We can use this database by client-server-based-system. In this paper, we introduce this system mainly on user-interface.
收起
摘要 :
Emerging distributed query-processing systems support flexible execution strategies in which earch query can be run using a combination of data shipping and query shipping. As in any distributed environment, these systems can obta...
展开
Emerging distributed query-processing systems support flexible execution strategies in which earch query can be run using a combination of data shipping and query shipping. As in any distributed environment, these systems can obtain tremendous performance and availability benefits by employing dynamic data caching. When flexible execution and dynamic caching are combined, however, a circular dependency arises: Caching occurs as a by-product of query operator placement, but query operator placement decisions are base don (cached) data location. The practical impact of this dependency is that query optimization decisions that appear valid on a per-query basis can actually cause suboptimal performance for all queries in the long run.
收起
摘要 :
Applications that use directory services or relational databases operate in a client-server model, where a client requests information from a server, and the server returns a response to the client. These client-server application...
展开
Applications that use directory services or relational databases operate in a client-server model, where a client requests information from a server, and the server returns a response to the client. These client-server applications typically have a specific message protocol that is unique to that application. Systems with multiple client-server applications require that there are separate client programs that individually communicate with their respective server programs. A need exists to access information from heterogeneous systems in a standard message request-response format. A generic eXtensible Markup Language (XML) model was developed to obtain data from diverse measurement systems. The objective of this paper is to describe the XML model that abstracts the differences in the underlying heterogeneous client-server message formats and provides a common XML message interface. The XML messages are parsed through a common XML gateway that decides to which application server to forward the messages. The generic XML messages are translated to the correct application server format before being sent to the application server.
收起
摘要 :
In future the advancement of technology in System Security application, need to perform advancesecurity with high availability. The communication network is a process to transfer the information from oneplace to another and it lea...
展开
In future the advancement of technology in System Security application, need to perform advancesecurity with high availability. The communication network is a process to transfer the information from oneplace to another and it leads to the development of security issues in emerging technology. In the securitynetwork the additional attention from analysis to development community and hospitality. The developmentof security issues is in under research and we needs to analyze the part of the authentication of other usersusing MAC address. In security system the MAC address cannot be applied to authentication by directly owingto restricted resources. The main issues of security issues in the networks are Privacy, Technical faults,Accuracy. Therefore to analyze the user nodes from one node to another node and finally to show the MACaddress of the each connected systems by using the user IP Address to access the data.
收起
摘要 :
Using a sample of 350 companies, this paper investigates the benefits of client-server systems and links them to a set of implementation factors. The paper reveals that companies can expect competitive, operational, financial and ...
展开
Using a sample of 350 companies, this paper investigates the benefits of client-server systems and links them to a set of implementation factors. The paper reveals that companies can expect competitive, operational, financial and technical benefits. It reports several important steps, activities and tasks that are positively related to those benefits, including defining clear organizational objectives and strategies, re-organizing corporate data and testing multiple levels of clients and servers. Furthermore, they list some of the problems that companies may encounter during a client-server implementation. The paper is relevant to managers and academicians who want to better understand the implementation of client-server.
收起
摘要 :
The execution of a client/server application involving database access requires a sequence of database transaction events (or, T-events), called a transaction sequence (or, T-sequence). A client/server database application may hav...
展开
The execution of a client/server application involving database access requires a sequence of database transaction events (or, T-events), called a transaction sequence (or, T-sequence). A client/server database application may have nondeterministic behavior in that multiple executions thereof with the same input may produce different T-sequences. We present a framework for testing all possible T-sequences of a client/server database application. We first show how to define a T-sequence in order to provide sufficient information to detect race conditions between T-events. Second, we design algorithms to change the outcomes of race conditions in order to derive race variants, which are prefixes of other T-sequences. Third, we develop a prefix-based replay technique for race variants derived from T-sequences. We prove that our framework can derive all the possible T-sequences in cases where every execution of the application terminates. A formal proof and an analysis of the proposed framework are given. We describe a prototype implementation of the framework and present experimental results obtained from it.
收起
摘要 :
We study client-server caching of data with expiration timestamps. Although motivated by the potential for caching in telecommunication applications, our work extends to the general case of caching data that has known expiration t...
展开
We study client-server caching of data with expiration timestamps. Although motivated by the potential for caching in telecommunication applications, our work extends to the general case of caching data that has known expiration times. Toward this end, we tailor caching algorithms to consider expiration timestamps. Next, we consider several different client-server apradigms that differ in whether and how the server updates client caches.
收起
摘要 :
The execution of a client/server application involving database access requires a sequence of database transaction events (or, T-events), called a transaction sequence (or, T-sequence). A client/server database application may hav...
展开
The execution of a client/server application involving database access requires a sequence of database transaction events (or, T-events), called a transaction sequence (or, T-sequence). A client/server database application may have nondeterministic behavior in that multiple executions thereof with the same input may produce different T-sequences. We present a framework for testing all possible T-sequences of a client/server database application. We first show how to define a T-sequence in order to provide sufficient information to detect race conditions between T-events. Second, we design algorithms to change the outcomes of race conditions in order to derive race variants, which are prefixes of other T-sequences. Third, we develop a prefix-based replay technique for race variants derived from T-sequences. We prove that our framework can derive all the possible T-sequences in cases where every execution of the application terminates. A formal proof and an analysis of the proposed framework are given. We describe a prototype implementation of the framework and present experimental results obtained from it.
收起
